Failure-divergence semantics and refinement of long running transactions

Compensating CSP (cCSP) models long-running transactions. It can be used tospecify service orchestrations written in programming languages like WS-BPEL.However, the original cCSP does not allow to model internal (non-deterministic)choice, synchronized parallel composition, hiding or recursion. In this paper, weintroduce these operators and define for the extended language a failure-divergence(FD) semantics to allow reasoning about non-determinism, deadlock and livelock.Furthermore, we develop a refinement calculus that allows us to compare the levelof non-determinism between long running transactions, and transform specificationsfor design and analysis.